Consistent Discretization of Linear Inverse Problems using Sparse Stochastic Processes

نویسندگان

  • Emrah Bostan
  • Ulugbek S. Kamilov
  • Masih Nilchian
  • Michael Unser
چکیده

We introduce a novel discretization paradigm and specify MAP estimators for linear inverse problems by using the theory of continuous-domain sparse stochastic processes. We characterize the complete class of admissible priors for the discretized version of the signal and show that the said class is restricted to the family of infinitely divisible distributions. We also explain the connections between our estimators and the existing deterministic methods such as Tikhonov and `p-type (with p ∈ (0, 1]) regularizations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Sparse Markov Chain Approximation of Lq-type Stochastic Control Problems

We propose a novel Galerkin discretization scheme for stochastic optimal control problems on an indefinite time horizon. The control problems are linear-quadratic in the controls, but possibly nonlinear in the state variables, and the discretization is based on the fact that problems of this kind admit a dual formulation in terms of linear boundary value problems. We show that the discretized l...

متن کامل

Hierarchical low-rank approximation of tensors by successive rank one corrections for preconditioning and solving high dimensional linear systems

We propose an algorithm for preconditioning and solving high dimensional linear systems of equations in tensor format. The algorithm computes an approximation of a tensor in hierarchical Tucker format in a subspace constructed from successive rank one corrections. The algorithm can be applied for the approximation of a solution or of the inverse of an operator. In the latter case, properties su...

متن کامل

Scenario generation for stochastic optimization problems via the sparse grid method

We study the use of sparse grids methods for the scenario generation (or discretization) problem in stochastic programming problems where the uncertainty is modeled using a continuous multivariate distribution. We show that, under a regularity assumption on the random function, the sequence of optimal solutions of the sparse grid approximations, as the number of scenarios increases, converges t...

متن کامل

Sparsity-Driven Statistical Inference for Inverse Problems

This thesis addresses statistical inference for the resolution of inverse problems. Our work is motivated by the recent trend whereby classical linear methods are being replaced by nonlinear alternatives that rely on the sparsity of naturally occurring signals. We adopt a statistical perspective and model the signal as a realization of a stochastic process that exhibits sparsity as its central ...

متن کامل

State estimation approach to nonstationary inverse problems: discretization error and filtering problem

We examine a certain class of nonstationary inverse problems. We view them as a state estimation problem. The time evolution of the state of the system is modeled by a stochastic differential equation. The observation equation is linear with additive measurement noise. We introduce the time discrete infinite dimensional state estimation system concerning the problem. For computational reasons t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013